package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution1334 {
    public int findTheCity(int n, int[][] edges, int distanceThreshold) {
        return GraphUtils.findTheCity(n, edges, distanceThreshold);
    }
}

public class leetcode1334 {
    public static void main(String[] args) {
        Solution1334 solution1334 = new Solution1334();
        int n = 4;
        int[][] edges = {{0, 1, 3}, {1, 2, 1}, {1, 3, 4}, {2, 3, 1}};
        int distanceThreshold = 4;
        System.out.println(solution1334.findTheCity(n, edges, distanceThreshold));
    }
}
